Uniform Circuits, & Boolean Proof Nets
نویسندگان
چکیده
The relationship between Boolean proof nets of multiplicative linear logic (APN) and Boolean circuits has been studied [Ter04] in a non-uniform setting. We refine this results by taking care of uniformity: the relationship can be expressed in term of the (Turing) polynomial hierarchy. We give a proofs-as-programs correspondence between proof nets and deterministic as well as non-deterministic Boolean circuits with a uniform depth-preserving simulation of each other. The Boolean proof nets class mNBN (poly) is built on multiplicative and additive linear logic with a polynomial amount of additive connectives as the nondeterministic circuit class NNC (poly) is with non-deterministic variables. We obtain uniform-APN = NC and mNBN (poly) = NNC (poly) = NP .
منابع مشابه
Uniform circuits, N Boolean proof nets
The relationship between Boolean proof nets of multiplicative linear logic (APN) and Boolean circuits has been studied [Ter04] in a non-uniform setting. We refine the results taking care of uniformity: the relationship can be expressed in term of the (Turing) polynomial hierarchy. We give a proofs-as-programs correspondence between proof nets and deterministic as well as non-deterministic Boole...
متن کاملSublogarithmic uniform Boolean proof nets
Using a proofs-as-programs correspondence, Terui was able to compare two models of parallel computation: Boolean circuits and proof nets for multiplicative linear logic. Mogbil et. al. gave a logspace translation allowing us to compare their computational power as uniform complexity classes. This paper presents a novel translation in AC and focuses on a simpler restricted notion of uniform Bool...
متن کاملNon-deterministic Boolean Proof Nets
We introduce Non-deterministic Boolean proof nets to study the correspondence with Boolean circuits, a parallel model of computation. We extend the cut elimination of Non-deterministic Multiplicative Linear logic to a parallel procedure in proof nets. With the restriction of proof nets to Boolean types, we prove that the cut-elimination procedure corresponds to Non-deterministic Boolean circuit...
متن کاملNon-Uniform Hardness for NP via Black-Box Adversaries
We may believe SAT does not have small Boolean circuits. But is it possible that some language with small circuits looks indistiguishable from SAT to every polynomial-time bounded adversary? We rule out this possibility. More precisely, assuming SAT does not have small circuits, we show that for every language with small circuits, there exists a probabilistic polynomial-time algorithm that make...
متن کاملUniform proofs of ACC representations
We give a uniform proof of the theorems of Yao and Beigel-Tarui representing ACC predicates as constant depth circuits with MODm gates and a symmetric gate. The proof is based on a relativized, generalized form of Toda’s theorem expressed in terms of closure properties of formulas under bounded universal, existential and modular counting quantifiers. This allows the main proofs to be expressed ...
متن کامل